Terminological Cycles in a Description Logic with Existential Restrictions
نویسنده
چکیده
Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles for the language . , which allows for conjunction, existential restrictions, and the topconcept. In contrast to the results for , subsumption in remains polynomial, independent of whether we use least fixpoint semantics, greatest fixpoint semantics, or descriptive semantics.
منابع مشابه
Restricted Role-value-maps in a Description Logic with Existential Restrictions and Terminological Cycles
In a previous paper we have investigated subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, and the top concept, and have shown that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics. In this paper we show that subsumption...
متن کاملLeast Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles
Computing least common subsumers (Ics) and most specific concepts (msc) are inference tasks that can support the bottom-up construction of knowledge bases in description logics. In description logics with existential restrictions, the most specific concept need not exist if one restricts the attention to concept descriptions or acyclic TBoxes. In this paper, we extend the notions les and msc to...
متن کاملSaturation-based Decision Procedures for Extensions of the Guarded Fragment
We apply the framework of Bachmair and Ganzinger for saturation-based theorem proving to derive a range of decision procedures for logical formalisms, starting with a simple terminological language EL, which allows for conjunction and existential restrictions only, and ending with extensions of the guarded fragment with equality, constants, functionality, number restrictions and compositional a...
متن کاملCFDnc: A PTIME Description Logic with Functional Constraints and Disjointness
We consider CFDnc, an alternative to the description logic CFD that retains the latter’s ability to support PTIME reasoning in the presence of terminological cycles with universal restrictions over functional roles and also in the presence of functional constraints over functional role paths. In contrast, CFDnc replaces the ability to have conjunction on left-hand-sides of inclusion dependencie...
متن کاملApplications and Extensions of PTIME Description Logics with Functional Constraints
We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attribute-connected conjunctive queries, showing that both problems are in PTIME. We then consider th...
متن کامل